On well-dominated direct, Cartesian and strong product graphs
نویسندگان
چکیده
If each minimal dominating set in a graph is minimum set, then the called well-dominated. Since seminal paper on well-dominated graphs appeared 1988, structure of from several restricted classes has been studied. In this we give complete characterization nontrivial direct products that are We prove if strong product well-dominated, both its factors When one graph, other factor being also sufficient condition for to be Our main result gives Cartesian which at least graph. addition, conjecture actually class nontrivial, products.
منابع مشابه
On the Cartesian Product of Non Well-Covered Graphs
A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of Topp and Volkmann [5] and prove that if the Cartesian product of two graphs is well-covered, then at least one of them must be well-covered.
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملLocally Well-Dominated and Locally Independent Well-Dominated Graphs
In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irredundance number, the domination number and the independent domination number can be computed in polynomial time within several classes of graphs, e....
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113178